Listing all the minimal separators of a planar graph
نویسنده
چکیده
I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) per separator.
منابع مشابه
Listing all the minimal separators of a 3-connected planar graph
We present an efficient algorithm that lists the minimal separators of a 3-connected planar graph in O(n) per separator.
متن کاملListing All Minimal Separators of a Graph
An efficient algorithm listing all minimal vertex separators of an undirected graph is given. The algorithm needs polynomial time per separator that is found.
متن کاملGenerating All the Minimal Separators of a Graph
We present an eecient algorithm which computes the set of minimal separators of a graph in O(n 3) time per separator, thus gaining a factor of n 2 on the current best-time algorithms for this problem. Our process is based on a new structural result, derived from Kloks and Kratsch's work on listing all the minimal separators of a graph.
متن کاملListing All Potential Maximal Cliques of a Graph
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal triangulation of that graph. It is known that if these objects can be listed in polynomial time for a class of graphs, the treewidth and the minimum 5ll-in are polynomially tractable for these graphs. We show here that the potential maximal cliques of a graph can be generated in polynomial time i...
متن کاملTreewidth of planar graphs: connection with duality
A graph is said to be chordal if each cycle with at least four vertices has a chord, that is an edge between two non-consecutive vertices of the cycle. Given an arbitrary graph G = (V, E), a triangulation of G is a chordal graph H(= V, F) such that E ⊆ F. We say that H is a minimal triangulation of G if no proper subgraph of H is a triangulation of G. The treewidth tw(H) of a chordal graph is i...
متن کامل